on the number of mutually disjoint cyclic designs

we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all  $k$-subsets ofa $v$-set into $n$ disjoint  $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$.   we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and $n(2,31,4,2)$. consequentlywe present new large sets $ls[9](2,4,29), ls[13](2,4,29)$ and$ls[7](2,4,31)$,  where their existences were already known.